Concurrency and atomicity

Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors

Data races do not cover all kinds of concurrency errors. This paper presents a data-flow-based technique to find stale-value errors, which are not found by low-level and high-level data race algorithms. Stale values denote copies of shared data where the copy is no longer synchronized. The algorithm to detect such values works as a consistency check that does not require any assumptions or anno...

Concurrency vs. availability : atomicity mechanisms for replicated data

Atomicity vs. availability : concurrency control for replicated data

Data managed by a distr ibuted program may be subject to consistency and availability requirements that must be satisfied in the presence of concurrency, site crashes, and network partit ions. This paper proposes two integrated methods for implementing concurrency control and replication for data of abstract type. Both methods use quorum consensus. The Consensus Locking method minimizes constra...

Procedures and Atomicity Refinement

We deene a return statement for procedures in an action systems framework and show that it corresponds to carrying out an atomicity reenement. Hence, the introduction of an early return from a (remote) procedure call can increase the degree of parallelism in a parallel or distributed algorithm modelled by an action system.

Atomicity and Normalization

A common aim of data modeling approaches is to produce schemas whose instantiations are always redundancy-free. This is especially useful when the implementation target is a relational database. This paper contrasts two very different approaches to attain a redundancy-free relational schema. The ObjectRole Modeling (ORM) approach emphasizes capturing semantics first in terms of atomic (elementa...